Перевод: с русского на все языки

со всех языков на русский

finite state automaton

См. также в других словарях:

  • Aperiodic finite state automaton — An aperiodic finite state automaton is a finite state automaton whose transition monoid is aperiodic.PropertiesA regular language is star free if and only if it is accepted by an automaton with a finite and aperiodic transition monoid. This… …   Wikipedia

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… …   Wikipedia

  • Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

  • finite state machine — baigtinis automatas statusas T sritis automatika atitikmenys: angl. finite automaton; finite state machine vok. endlicher Automat, m; Finalautomat, m rus. конечный автомат, m pranc. automate final, m; automate fini, m; automate terminal, m;… …   Automatikos terminų žodynas

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

  • Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

  • Generalized nondeterministic finite state machine — In the theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA) is a NFA where each transition may be labeled with any regular expression. The GNFA reads blocks of symbols… …   Wikipedia

  • Finite — is the opposite of infinite. It may refer to:* Having a finite number of elements: finite set * Being a finite number, so not equal to pminfty; all real numbers are finite * In a stronger sense, being a value that is neither infinite nor… …   Wikipedia

  • Automaton (disambiguation) — Automaton may refer to:* Automaton, a self operating machine * Automaton , a song by London s Neo New Wave Band The Rakes * An automaton, a mathematical model for a finite state machine (see automata theory) …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»